Strictness and Totality Analysis
نویسنده
چکیده
We definea novel inference system for strictness and totality analysis for the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those terms that definitely do not denote bottom (i.e. do evaluate to WHNF). The analysis is presented as an annotated type system allowing conjunctions only at “top-level”. We give examples of its use and prove the correctness with respect to a natural-style operational semantics.
منابع مشابه
Strictness and Totality Analysis with Conjunction
We extend the strictness and totality analysis of 12] by allowing conjunction at all levels rather than at the top-level. We prove the strictness and totality analysis correct with respect to a denotational semantics and nally construct an algorithm for inferring the strictness and totality properties .
متن کاملOn Strictness and Totality
Abs t rac t . In this paper we present a revised and extended version of the strictness and totality type assignment system introduced by Solberg, Nielson and Nielson in the Static Analysis Symposium '9~. Our main result is that (w.r.t. the possibility of replacing safely a lazy application by a strict one) the strictness and totality information given by this system is equivalent to the inform...
متن کاملStrictness, totality, and non-standard-type inference
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness results for both the strictness and the totality-type entailment relations. We also study the interactions between strictness and totality analyses, showing that the information obtainable by a system that combines the...
متن کاملNon-standard type inference for functional programs
We propose a general framework for “non-standard type inference based” static analyses of typed functional programs and study inference systems (with and without conjunction) for strictness, totality, and dead-code analyses. A key feature of our framework is that it provides a foundation of the program analyses which is based directly on the operational semantics of the programming language con...
متن کاملUniform PERs and Comportment Analysis
Hunt showed that the notion of PER-based strictness properties subsumed the incomparable notions of idealand projection-based properties on non-lifted value spaces. We extend Hunt’s idea so it can encompass other comportment properties (such as totality) by separating the information and fixpoint orderings. We then define a class of uniform PERs (in the sense that they treat non-bottom ground e...
متن کامل